Vertex-deleted and Edge-deleted Subgraphs
نویسنده
چکیده
The foremost problem in this area of graph theory is the Reconstruction Conjecture which states that a graph is reconstructible from its collection of vertex-deleted subgraphs. In spite of several attempts to prove the conjecture only very partial results have been obtained. Several of these results do however bring to light interesting structural relationships between a graph and its subgraphs. For example, can all the subgraphs of a nonplanar graph be planar? Some reconstruction results viewed in this light will be discussed here.
منابع مشابه
On the Wiener Index of Some Edge Deleted Graphs
The sum of distances between all the pairs of vertices in a connected graph is known as the {it Wiener index} of the graph. In this paper, we obtain the Wiener index of edge complements of stars, complete subgraphs and cycles in $K_n$.
متن کاملAutomorphism Groups of a Graph and a Vertex-Deleted Subgraph
Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-free generation. This paper raises the question of which pairs of groups can be represented as the automorphism groups of a graph and a vertex-deleted subgraph. This, and more surprisingly the analogous qu...
متن کاملMaximal proper subgraphs of median graphs
For a median graph G and a vertex v of G that is not a cut-vertex we show that G − v is a median graph precisely when v is not the center of a bipartite wheel, which is in turn equivalent with the existence of a certain edge elimination scheme for edges incident with v. This implies a characterization of vertex-critical (respectively, vertex-complete) median graphs, which are median graphs whos...
متن کاملThe Characteristic Polynomial of a Graph is Reconstructible from the Characteristic Polynomials of its Vertex-Deleted Subgraphs and Their Complements
The question of whether the characteristic polynomial of a simple graph is uniquely determined by the characteristic polynomials of its vertex-deleted subgraphs is one of the many unresolved problems in graph reconstruction. In this paper we prove that the characteristic polynomial of a graph is reconstructible from the characteristic polynomials of the vertex-deleted subgraphs of the graph and...
متن کاملGraph Reconstruction
In 1941 Kelly and Ulam proposed the Graph Reconstruction Conjecture, and it has remained an open problem to this day[3]. The Graph Reconstruction Conjecture states simply that any simple finite undirected graph on 3 or more vertices can be uniquely identified (up to isomorphism) by the multiset of its unlabeled 1-vertex-deleted subgraphs. There are no known counter-examples to the Conjecture, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992